Random Records and Cuttings in Binary Search Trees
نویسنده
چکیده
We study the number of records in a random binary search tree on n randomly labelled vertices. Equivalently the number of random cuttings required to eliminate a random binary search tree can be studied. After normalization the distribution is shown to be asymptotically 1-stable.
منابع مشابه
Random Records and Cuttings in Complete Binary Trees
We study the number of records in a complete binary tree with randomly labeled vertices or edges. Equivalently, we may study the number of random cuttings required to eliminate a complete binary tree. The distribution is, after normalization, asymptotically a periodic function of lgn − lg lgn; thus there is no true asymptotic distribution but a family of limits of different subsequences; these ...
متن کاملProfile and Height of Random Binary Search Trees
The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.
متن کاملP´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کاملMini-Workshop: Probability Theory on Trees and Analysis of Algorithms
Random records and cuttings in trees Svante Janson We consider random cutting down of rooted trees, defined as follows [6]. If T is a rooted tree with number of vertices |T | ≥ 2, we make a random cut by choosing one edge at random. Delete this edge so that the tree separates into two parts, and keep only the part containing the root. Continue recusively until only the root is left. We let X(T ...
متن کاملProbabilistic analysis of the asymmetric digital search trees
In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 19 شماره
صفحات -
تاریخ انتشار 2010